A Convergent Series for the Partition Function p(n)
نویسندگان
چکیده
منابع مشابه
a time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Double series representations for Schur's partition function and related identities
We prove new double summation hypergeometric q-series representations for several families of partitions, including those that appear in the famous product identities of Göllnitz, Gordon, and Schur. We give several different proofs for our results, using bijective partitions mappings and modular diagrams, the theory of q-difference equations and recurrences, and the theories of summation and tr...
متن کاملThe Hardy-Littlewood Function An Exercise in Slowly Convergent Series
The function in question is H(x) = ∑∞ k=1 sin(x/k)/k. In deference to the general theme of this conference, a summation procedure is first described using orthogonal polynomials and polynomial/rational Gauss quadrature. Its effectiveness is limited to relatively small (positive) values of x. Direct summation with acceleration is shown to be more powerful for very large values of x. Such values ...
متن کاملRapidly Convergent Series for the Weierstrass Zeta-function and the Kronecker Function
We present expressions for the Weierstrass zeta-function and related elliptic functions by rapidly convergent series. These series arise as triple products in the A∞-category of an elliptic curve. 1. Formulas In this section we derive our formulas by classical means. In the next section we’ll explain how one can guess these formulas from the computation of certain triple products on elliptic cu...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1937
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.23.2.78